Abstract
Let Xn = { } 1,2,…,n be a finite n -element set and let Sn An and Dn , be the Symmetric, Alternating and Dihedral groups of Xn , respectively. In this thesis we obtained and discussed formulae for the number of even and odd permutations (of an n − element set) having exactly k fixed points in the alternating group and the generating functions for the fixed points. Further, we give two different proofs of the number of even and odd permutations (of an n − element set) having exactly k fixed points in the dihedral group, one geometric and the other algebraic. In the algebraic proof, we further obtain the formulae for determining the fixed points. We finally proved the three families; F(2r,4r + 2), F(4r +3,8r + 8) and F( ) 4r +5,8r +12 of the Fibonacci groups F( ) m ,n to be infinite by defining Morphism between Dihedral groups and the Fibonacci groups.
Background of the Study
Economic zoning, which involves designating specific areas for targeted economic activities, has ga...
Digital health records, also known as electronic health reco...
Chapter One: Introduction
Background of the Study
Public sector accounting is crucial for managing federal allocations effectivel...
Background of the study
University admission processes are critical to ensuring that qualified candidates gain access to higher education...
Statement of Problem
The act and practice of smoking cigarette also impacts differently amongst respective societies, cultures and ecosys...
THE ROLE OF MULTITASKING IN ADMINISTRATIVE ROLES
Abstract: The objective of this study...
ABSTRACT
The main focus of this study is to examine the implication of twitter ban on digital marketing...
Chapter One: Introduction
1.1 Background of the Study
Inter...
Background of the Study
In an era marked by sophisticated financial crimes, internal enforcement mechanisms have become...